Wide Area Cartesian Routing

نویسندگان

  • Larry Hughes
  • Omid Banyasad
  • Evan Hughes
چکیده

Cartesian routing is a fast packet routing mechanism intended for geographic addresses and can effectively accelerate the packet routing process within a local or metropolitan environment. The wide area Cartesian routing described in this paper is an extension of the Cartesian routing algorithms designed to make the exchange of internetwork packets between geographical regions possible. It also introduces a new hierarchical structure for the entire Internet. The proposed Internet is viewed as a hierarchy of networks consisting of routers. At the highest level of this hierarchy, major routers exchange packets between large geopolitical areas such as countries, states, or provinces. At the lowest level of the structure, packets are routed between local routers in small geographical regions ranging from an office to a small town. There are only four layers in this structure and at each layer Cartesian routing is employed to send packets from the source router to the destination.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

UN CO RR EC TE D PR OO F Cartesian routing

Cartesian routing is a novel packet routing methodology in which a packet's route is determined by the position of the router relative to that of the destination. Cartesian routing di€ers from existing provider-based unicast routing in that routing tables are unnecessary since communications are topologically dependent, thereby potentially reducing router and network overheads. For example, rou...

متن کامل

Routing and Addressing Problems

This report discusses some of the problems and limitations in existing internetwork design for the connection of packet-switching networks of different technologies and presents an algorithm that has been shown to be suitable for internetworks of unbounded size. Using a new form of address and a flat routing mechanism called Cartesian routing, this algorithm is designed to solve three problems:...

متن کامل

Cartesian Routing Progress to Date and Future Directions

Existing hierarchical routing schemes, employing distance vector and link state routing algorithms, require the exchange of routing information for the construction and maintenance of routing tables [1]. As networks increase in size, the memory requirements for the routing tables and the time taken to search the tables increase proportionally [11]. Further, as the popularity of computer network...

متن کامل

Appletalk Update-Based Routing Protocol: Enhanced Appletalk Routing

Status of This Memo This memo provides information for the Internet community. It does not specify an Internet standard. Distribution of this memo is unlimited. Introduction This memo is being distributed to members of the Internet community to fully document an Apple protocol that may be running over the Internet. While the issues discussed may not be directly relevant to the research problems...

متن کامل

Deployment of Class-based Routing in Wide Area Networks: Overhead and Performance Assessment

A Quality of Service (QoS) routing protocol for the Differentiated Services framework is being developed at the University of Coimbra (UC-QoSR). The main contribution of this paper is the evaluation of the protocol in wide area networks concerning traffic performance and protocol overhead. Many interesting QoS routing proposals have been proposed. However their evaluation has been conducted in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002